Betweenness centrality in a weighted network
نویسندگان
چکیده
منابع مشابه
Betweenness centrality in a weighted network.
When transport in networks follows the shortest paths, the union of all shortest path trees G union or logical sum SPT can be regarded as the "transport overlay network." Overlay networks such as peer-to-peer networks or virtual private networks can be considered as a subgraph of G union or logical sum SPT. The traffic through the network is examined by the betweenness Bl of links in the overla...
متن کاملEnhancing synchronizability of weighted dynamical networks using betweenness centrality.
By considering the eigenratio of the Laplacian of the connection graph as a synchronizability measure, we propose a procedure for weighting dynamical networks to enhance their synchronizability. The method is based on node and edge betweenness centrality measures and is tested on artificially constructed scale-free, Watts-Strogatz, and random networks as well as on some real-world graphs. It is...
متن کاملFully Dynamic Betweenness Centrality
We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν∗ · log n) time per update with our basic algorithm, and O(ν∗ · log n) time with a more complex algorithm, where n = |V |, and ν∗ bounds the number...
متن کاملBetweenness centrality profiles in trees
Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The kbetweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most k. The sequence of k-betweenness centralities for all possible values of k forms the betwee...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2008
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.77.046105